A Distributed Optimization Approach to Constrained OSNR Problem
نویسندگان
چکیده
This paper studies constrained optical signal-to-noise ratio (OSNR) problem via a distributed optimization approach. In multi-channel optical systems, the signal over an optical link can be regarded as an interfering noise for others, which leads to OSNR degradation. Regulating the input optical power at the Source (transmitter) aims to achieve satisfactory OSNR level at the Destination (receiver) for each channel. Moreover, because all wavelengthmultiplexed channels in a link share the same optical fiber, the total input power in a link has to be below the nonlinearity threshold, which corresponds to a link capacity constraint. We formulate the OSNR optimization problem as one of utility maximization with the objectives of achieving an OSNR target level for each channel while minimizing the interference and also satisfying the link capacity constraint. We derive conditions for the existence of a unique optimal solution, leading to a basis for an admission control scheme. By using a Lagrangian relaxation approach we propose two distributed update algorithms: a primal algorithm and a dual algorithm, and study their convergence properties both theoretically and numerically.
منابع مشابه
Effects of parameters on Nash games with OSNR target
This paper studies efficiency in a Nash game with optical signal-to-noise ratio (OSNR) target. Instead of looking from the view point of degree of efficiency (“price of anarchy”), we investigate the effects of parameters in individual cost functions. We show that the aggregate cost function in the game-theoretic formulation is not automatically convex and the optimal solution of the associated ...
متن کاملAn Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملEstimating the Parameters in Photovoltaic Modules: A Constrained Optimization Approach
This paper presents a novel identification technique for estimation of unknown parameters in photovoltaic (PV) systems. A single diode model is considered for the PV system, which consists of five unknown parameters. Using information of standard test condition (STC), three unknown parameters are written as functions of the other two parameters in a reduced model. An objective function and ...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008